Compositional Veri cation of Real - time Systems
نویسندگان
چکیده
This paper presents a compositional proof system for the veriication of real-time systems. Real-time systems are modeled as timed transition modules, which explicitly model interaction with the environment and may be combined using composition operators. Composition rules are devised such that the correct-ness of a system may be determined from the correct-ness of its components. These proof rules are demonstrated on Fischer's mutual exclusion algorithm, for which mutual exclusion and bounded response are proven.
منابع مشابه
Model-Checking for Real-Time Systems
E cient automatic model{checking algorithms for real-time systems have been obtained in recent years based on the state{region graph technique of Alur, Courcoubetis and Dill. However, these algorithms are faced with two potential types of explosion arising from parallel composition: explosion in the space of control nodes, and explosion in the region space over clock-variables. This paper repor...
متن کاملProof of a Real { Time Mutual Exclusion Protocol K
In this paper, we apply a compositional proof technique to an automatic veri cation of the correctness of Fischer's mutual exclusion protocol. It is demonstrated that the technique may avoid the state{ explosion problem. Our compositional technique has recently been implemented in a tool CMC 5 , which veri es the protocol for 50 processes within 172.3 seconds and using only 32MB main memory. In...
متن کاملToward Compositional Analysis of Security Protocols Using Theorem Proving
Complex security protocols require a formal approach to ensure their correctness. The protocols are frequently composed of several smaller, simpler components. We would like to take advantage of the compositional nature of such protocols to split the large veri cation task into separate and more manageable pieces. Various formalisms have been used successfully for reasoning about large protocol...
متن کاملThe Temporal Specification and . . .
We extend the speci cation language of temporal logic, the corresponding veri cation framework, and the underlying computational model to deal with real-time properties of reactive systems. Semantics We introduce the abstract computational model of timed transition systems as a conservative extension of traditional transition systems: qualitative fairness requirements are superseded by quantita...
متن کاملAbstraction and Modular Veriication of Innnite-state Reactive Systems ?
ion and Modular Veri cation of In nite-State Reactive Systems ? Zohar Manna, Michael A. Col on, Bernd Finkbeiner, Henny B. Sipma and Tom as E. Uribe Computer Science Department Stanford University Stanford, CA. 94305-9045 [email protected] Abstract. We review a number of temporal veri cation techniques for reactive systems using modularity and abstraction. Their use allows the veri cation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994